Fuzzy approach to multilevel knapsack problems
نویسندگان
چکیده
منابع مشابه
Fuzzy Goal Programming Approach to Chance Constrained Multilevel Programming Problems
This paper presents a fuzzy goal programming (FGP) procedure for solving multilevel programming problems (MLPPs) having chance constraints in large hierarchical decision organizations. In the proposed approach, first the chance constraints of a problem are converted into their respective deterministic equivalent in the decision making context. Then, the objective functions of decision makers (D...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملModular Approach for Solving Nonlinear Knapsack Problems
This paper develops an algorithm based on the Modular Approach to solve singly constrained separable discrete optimization problems (Nonlinear Knapsack Problems). The Modular Approach uses fathoming and integration techniques repeatedly. The fathoming reduces the decision space of variables. The integration reduces the number of variables in the problem by combining several variables into one v...
متن کاملA Study of the Mean Field Approach to Knapsack Problems
The mean field theory approach to knapsack problems is extended to multiple knapsacks and generalized assignment problems with Potts mean field equations governing the dynamics. Numerical tests against "state of the art" conventional algorithms shows good performance for the mean field approach. The inherently parallelism of the mean field equations makes them suitable for direct implementation...
متن کاملAn approximate dynamic programming approach to convex quadratic knapsack problems
Quadratic knapsack problem (QKP) has a central role in integer and combinatorial optimization, while efficient algorithms to general QKPs are currently very limited. We present an approximate dynamic programming (ADP) approach for solving convex QKPs where variables may take any integer value and all coefficients are real numbers. We approximate the function value using (a) continuous quadratic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2005
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.07.025